Parallel Chip Firing Game Associated with n- cube Edges Orientations
نویسندگان
چکیده
We study the cycles generated by the chip firing game associated with n-cube orientations. We consider a particular class of partitions of vertices of n-cubes called left cyclic partitions that induce parallel periodic evolutions. Using this combinatorical model, we show that cycles generated by parallel evolutions are of even lengths from 2 to 2 on Hn (n ≥ 1), and of odd lengths different from 3 and ranging from 1 to 2n−1−1 on Hn (n ≥ 4). However, the question weather there exist parallel evolutions with period greater that 2 remains opened.
منابع مشابه
Parallel Chip Firing Game associated with n-cube orientations
We study the cycles generated by the chip firing game associated with n-cube orientations. We show the existence of the cycles generated by parallel evolutions of even lengths from 2 to 2n on Hn (n ≥ 1), and of odd lengths different from 3 and ranging from 1 to 2−1 on Hn (n ≥ 4).
متن کامل0 The lattice structure of Chip Firing
In this paper, we study a classical discrete dynamical system, the Chip Firing Game, used as a model in physics, economics and computer science. We use order theory and show that the set of reachable states (i.e. the configuration space) of such a system started in any configuration is a lattice, which implies strong structural properties. The lattice structure of the configuration space of a d...
متن کاملNo polynomial bound for period of the parallel chip game on graphs the firing
Kiwi, M.A., R. Ndoundam, M. Tchuente and E. Goles, Theoretical Computer Science 136 (1994) 527-532. The following (solitaire) game is considered: Initially each node of a simple, connected, finite graph contains a finite number of chips. A move consists in firing all nodes with at least as many chips as their degree, where firing a node corresponds to sending one of the node's chips to each one...
متن کاملA Variation on Chip-Firing: the diffusion game
We introduce a natural variant of the parallel chip-firing game, called the diffusion game. Chips are initially assigned to vertices of a graph. At every step, all vertices simultaneously send one chip to each neighbour with fewer chips. Although the parallel chip-firing game is inherently periodic as the dynamics occur on a finite set, the diffusion game is not obviously periodic: even if 2|E(...
متن کاملNo Polynomial Bound for the Period of the Parallel Chip Firing Game on Graphs
The following (solitaire) game is considered: Initially each node of a simple, connected , nite graph contains a nite number of chips. A move consists in ring all nodes with at least as many chips as their degree, where ring a node corresponds to sending one of the node's chips to each one of the node's neighbors. In Bi89] it was conjectured that every parallel chip ring game played on an N nod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004